A fair rule in minimum cost spanning tree problems
نویسندگان
چکیده
We study minimum cost spanning tree problems and de ne a cost sharing rule that satis es many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties. Keywords: Spanning tree. Cost allocation. Monotonicity. JEL Classi cation Numbers: C71, D63, D7.
منابع مشابه
A fair rule in minimum cost spanning tree problems Gustavo Bergantiños and Juan J . Vidal - Puga 06 - 05
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties.
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملRealizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
In the context of minimum cost spanning tree problems, we present a bargaining mechanism for connecting all agents to the source and dividing the cost amongst them. The basic idea is very simple: we ask each agent the part of the cost he is willing to pay for an arc to be constructed. We prove that there exists a unique payoff allocation associated with the subgame perfect Nash equilibria of th...
متن کاملAn axiomatic approach in minimum cost spanning tree problems with groups
We study minimum cost spanning tree problems with groups, where agents are located in di¤erent villages, cities, etc. The groups are the agents of the same village. In Bergantiños and Gómez-Rúa (2010, Economic Theory) we de ne the rule F as the Owen value of the irreducible game with groups and we prove that F generalizes the folk rule of minimum cost spanning tree problems. Bergantiños and Vid...
متن کاملOn Some Properties of Cost Allocation Rules in Minimum Cost Spanning Tree Problems
We consider four cost allocation rules in minimum cost spanning tree problems. These rules were introduced by Bird (1976), Dutta and Kar (2004), Kar (2002), and Feltkamp, Tijs and Muto (1994), respectively. We give a list of desirable properties and we study which properties are satisfied by these rules.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Economic Theory
دوره 137 شماره
صفحات -
تاریخ انتشار 2007